An $A$-proper map with prescribed topological degree
نویسندگان
چکیده
منابع مشابه
Abelian Varieties with Prescribed Embedding Degree
We present an algorithm that, on input of a CM-field K, an integer k ≥ 1, and a prime r ≡ 1 mod k, constructs a q-Weil number π ∈ OK corresponding to an ordinary, simple abelian variety A over the field F of q elements that has an F-rational point of order r and embedding degree k with respect to r. We then discuss how CM-methods over K can be used to explicitly construct A.
متن کاملOn ev-degree and ve-degree topological indices
Recently two new degree concepts have been defined in graph theory: ev-degree and ve-degree. Also the evdegree and ve-degree Zagreb and Randić indices have been defined very recently as parallel of the classical definitions of Zagreb and Randić indices. It was shown that ev-degree and ve-degree topological indices can be used as possible tools in QSPR researches . In this paper we d...
متن کاملA criterion for a proper rational map to be equivalent to a proper polynomial map
Let B be the unit ball in the complex space C. Write Rat(B,B) for the space of proper rational holomorphic maps from B into B and Poly(B,B ) for the set of proper polynomial holomorphic maps from B into B . We say that F and G ∈ Rat(B,B) are equivalent if there are automorphisms σ ∈ Aut(B) and τ ∈ Aut(B ) such that F = τ ◦G◦σ. Proper rational holomorphic maps from B into B with N ≤ 2n− 2 are eq...
متن کاملAsymptotics of trees with a prescribed degree sequence and applications
Let t be a rooted tree and ni(t) the number of nodes in t having i children. The degree sequence (ni(t), i ≥ 0) of t satisfies ∑ i≥0 ni(t) = 1 + ∑ i≥0 ini(t) = |t|, where |t| denotes the number of nodes in t. In this paper, we consider trees sampled uniformly among all plane trees having the same degree sequence s; we write Ps for the corresponding distribution. Let s(κ) = (ni(κ), i ≥ 0) be a l...
متن کاملAsymptotic of trees with a prescribed degree sequence and applications
Let t be a rooted tree and ni(t) the number of nodes in t having i children. The degree sequence (ni(t), i ≥ 0) of t satisfies ∑ i≥0 ni(t) = 1 + ∑ i≥0 ini(t) = |t|, where |t| denotes the number of nodes in t. In this paper, we consider trees sampled uniformly among all trees having the same degree sequence s; we write Ps for the corresponding distribution. Let s(κ) = (ni(κ), i ≥ 0) be a list of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1976
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1976-0410733-5